Design of LDPC-Coded Modulations for Fast Iterative Decoding
نویسندگان
چکیده
In this paper, we propose an EXIT chart-based approach to code design for low-density parity-check (LDPC)coded modulations. In particular, the adopted technique iteratively modifies the LDPC code degree distribution in order to achieve a target bit error rate (BER) at a given (and possibly small) number of iterations. In this paper, we limit ourselves to communication systems on a binary erasure channel (BEC), but the proposed approach is general. The optimized codes for a BEC give significant insights into the impact of the degree distributions on the BER performance.
منابع مشابه
Low-complexity LDPC coded BICM-ID with orthogonal modulations
A low-complexity low density parity check (LDPC) coded bit-interleaved coded modulation with iterative decoding (BICM-ID) scheme with orthogonal modulations is proposed. With a novel mapping strategy of coded bits to symbols, the proposed scheme is equivalent to a generalised LDPC code with Hadamard constraints and thus orthogonal demodulation can be merged into the iterative LDPC decoding proc...
متن کاملLDPC-Coded Modulations: Performance Bounds and a Novel Design Criterion
In this paper, we present a novel design criterion for low-density parity-check (LDPC)-coded modulations based on the concatenation of an LDPC code with a coded modulator (CM) tailored for the specific transmission channel. Although we use an analysis based on extrinsic information transfer (EXIT) charts, we focus on the bit error rate (BER) performance as opposed to the convergence threshold. ...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملDecoding and Computing Algorithms for Linear Superposition LDPC Coded Systems
This paper is concerned with linear superposition systems in which all components of the superimposed signal are coded with an identical binary low-density parity-check (LDPC) code. We focus on the design of decoding and computing algorithms. The main contributions of this paper include: 1) we present three types of iterative multistage decoding/computing algorithms, which are referred to as de...
متن کامل